Combinatorial Dichotomies in Set Theory
نویسندگان
چکیده
منابع مشابه
Combinatorial dichotomies in set theory
In this article we give an overview of a line of research in set theory that has reached a level of maturity and which, in our opinion, merits its being exposed to a more general audience. This line of research is concentrated on finding to which extent compactness fails at the level of first uncountable cardinal and to which extent it could be recovered at the level of some other not so large ...
متن کاملTwo Results in Combinatorial Set Theory
In this note we sketch the proofs of two results in combinatorial set theory. The common theme of the results is singular cardinal combinatorics: they involve the interaction between forcing, large cardinals, PCF theory and versions of Jensen’s weak square principle. 1. Changing cofinality Our first result involves an old question about changes of cofinality. Suppose that V,W are inner models o...
متن کاملSome Remarks on Set Theory, Ix . Combinatorial Problems in Measure Theory and Set Theory
Now, in analogy to Ramsay's theorem, one might consider the following problem. Suppose that, for some u > 0, there is associated with each k-tuple X = {x l , • • • , xk } of elements of an infinite set S a measurable set F(X) of [0, 1] such that m(F(X)) > u . Does there always exist an infinite subset S' of S such that the sets F(X) corresponding to the k-tuples X of S' have a nonempty intersec...
متن کاملcertain combinatorial topics in group theory
this article is intended to be a survey on some combinatorial topics in group theory. the bibliography at the end is neither claimed to be exhaustive, nor is it necessarily connected with a reference in the text. i include it as i see it revolves around the concepts which are discussed in the text.
متن کاملForbidden substructures and combinatorial dichotomies: WQO and universality
We discuss two combinatorial problems concerning classes of finite or countable structures of combinatorial type. We consider classes determined by a finite set of finite constraints (forbidden substructures). Questions about such classes are naturally viewed as algorithmic decision problems, taking the finite set of constraints as the input. While the two problems we consider have been studied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2011
ISSN: 1079-8986,1943-5894
DOI: 10.2178/bsl/1294186662